" Implementation of the Pastry Distributed Hash Table Lookup Service over the Ns-3 Network Simulator "

نویسندگان

  • Marios Pomonis
  • George Xylomenos
چکیده

This B.Sc. thesis report documents an implementation of the Pastry Distributed Hash Table (DHT) for the Network Simulator 3 (NS-3) simulation environment. To our knowledge, this thesis constitutes the first and only effort to cover the lack of any Pastry implementation for the NS-3 discrete event simulator. Given that NS-3 comes as an open source distribution, it is expected to meet the high demands of the research community and to follow the success and popularity of its predecessor NS-2. Thus, the contribution of this thesis is to provide an efficient C++ implementation to the NS community for research purposes. Moreover, for the sake of code clarity, ease of use and extendability of the work presented here, this thesis is further supported with a separate code manual and system documentation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Testbed-based Analysis of the Incorrect Lookup Routing Attack on the Pastry DHT

Distributed Hashtables (DHT), with Pastry [2] as a prominent representative, are one of the most recent peer-to-peer (P2P) architectures. DHTs scale well to the network size due to a small routing table and a hierarchical routing scheme. In Pastry, the number of routing entries scales logarithmically with respect to the number of participating nodes, because each node maintains route entries to...

متن کامل

Formal Verification Of Pastry Using TLA

Pastry [1, 2] is an algorithm that provides a scalable distributed hash table over an underlying P2P network. Several implementations of Pastry are available, but to the best of our knowledge the correctness of the algorithm has not been verified formally. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to churn and fault tolerance, we b...

متن کامل

Hierarchical Peer-to-Peer Systems

Structured peer-to-peer (P2P) lookup services—such as Chord, CAN, Pastry and Tapestry—organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. In these systems, data is associated with keys and each peer is responsible for a subset of the keys. We study hierarchical DHTs, in which peers are organized into groups, and each group has its autonomous intra-gr...

متن کامل

A Scalable Peer-to-Peer Lookup Model

One of the core problems of P2P computing is resource locating. The main research results of determined resource locating algorithms are four distributed hash table algorithms, i.e: CAN, Chord, Pastry and Tapestry. Based on these algorithms , this paper presents a hierarchical and manageable resource locating model (HMRLM)which can provide P2P networks with scalability and manageability.

متن کامل

A machine-checked proof of correctness of Pastry. (Une preuve certifiée par la machine de la correction du protocole Pastry)

A distributed hash table (DHT) is a peer-to-peer network that o↵ers the function of a classic hash table, but where di↵erent key-value pairs are stored at di↵erent nodes on the network. Like a classic hash table, the main function provided by a DHT is key lookup, which retrieves the value stored at a given key. Examples of DHT protocols include Chord, Pastry, Kademlia and Tapestry. Such DHT pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011